Synthesis of Supervisors Enforcing Firing Vector Constraints in Petri Nets

نویسندگان

  • Marian V. Iordache
  • Panos J. Antsaklis
چکیده

This paper considers the problem of enforcing linear constraints containing marking terms, firing vector terms, and Parikh vector terms. Such constraints increase the expressivity power of the linear marking constraints. We show how this new type of constraints can be enforced in Petri nets. In the case of fully controllable and observable Petri nets, we give the construction of a supervisor enforcing such constraints. In the case of Petri nets with uncontrollable and/or unobservable transitions, we reduce the supervisor synthesis problem to enforcing linear marking constraints on a transformed Petri net.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis of Supervisors Enforcing General Linear Vector Constraints in Petri Nets

This paper considers the problem of enforcing linear constraints containing marking terms, firing vector terms, and Parikh vector terms. Such constraints increase the expressivity power of the linear marking constraints. We show how this new type of constraints can be enforced in Petri nets. In the case of fully controllable and observable Petri nets, we give the construction of a supervisor en...

متن کامل

Synthesis of supervisors enforcing general linear constraints in Petri nets

Efficient techniques exist for the design of supervisors enforcing constraints consisting of linear marking inequalities. This note shows that without losing the benefits of the prior techniques, the class of constraints can be generalized to linear constraints containing marking terms, firing vector terms, and Parikh vector terms. We show that this extended class of constraints is more express...

متن کامل

Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions

This paper proposes an analytical method for the synthesis of reversibility-enforcing supervisors for bounded Petri nets. The proposed method builds upon recent developments from (i) the theory of regions, that enables the design of Petri nets with pre-specified behavioral requirements, and (ii) the theory concerning the imposition of generalized mutual exclusion constraints on the net behavior...

متن کامل

Petri Net Supervisory Method for Linear Constraints and its Applications to Flexible Manufacturing Systems

An algorithm is proposed to equivalently transform original linear constraints on Petri nets, where the uncontrollable subnets are forward-concurrent free nets, into admissible ones. Consequently, this algorithm can be used to design both efficient and optimal supervisors for enforcing linear constraints on Petri nets since the problem on how to enforce admissible constraints has been well solv...

متن کامل

T -Liveness Enforcement in Petri Nets Based on Structural Net Properties

We introduce a semidecidable procedure which, given a Petri net structure and a set T of transitions, synthesizes a supervisor enforcing the transitions in T to be live. We call this liveness property T -liveness. When T equals the total set of Petri net transitions, T -liveness corresponds to liveness. Enforcing only a subset of transitions to be live is useful when some Petri net transitions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002